class HashTable<T = any> {
    // 创建一个数组，用来存放链表地址中的链(数组)
    private storage: [string: T][][] = [];
    // 定义数组的长度，count/length 为哪个什么因子，大于0.75提醒扩容(增加数组长度)
    private length: number = 7;
    // 记录已经存在的元素的个数
    private count: number = 0;

    private hashFunc(key: string, max:number):number{ 
        let hashCode = 0;
        const length = key.length;
        for (let i = 0; i < length; i++) {
            hashCode = 31 * hashCode + key.charCodeAt(i);
        }
        // 计算出索引值
        const index = hashCode % max;
    
        return index
    }
    
}

const hashTable = new HashTable();




export default {}